On Various Parameters of Zq-Simplex codes for an even integer q
نویسندگان
چکیده
In this paper, we defined the Zq-linear codes and discussed its various parameters. We constructed Zq-Simplex code and Zq-MacDonald code and found its parameters. We have given a lower and an upper bounds of its covering radius for q is an even integer.
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملNew Ternary and Quaternary Constant-Weight Equidistant Codes
Consider a finite set of q elements and containing a distinguished element ”zero”. The choice of a set does not matter in our context and we will use the set Zq of integers modulo q. Let Z q be the set of n-tuples (or vectors) over Zq and Z n,w q be the set of n-tuples over Zq of Hamming weight w. A code is called constant-weight if all the codewords have the same weight w. A code is called equ...
متن کاملAn Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets
We prove a lower estimate on the increase in entropy when two copies of a conditional random variable X|Y , with X supported on Zq = {0, 1, . . . , q − 1} for prime q, are summed modulo q. Specifically, given two i.i.d. copies (X1, Y1) and (X2, Y2) of a pair of random variables (X,Y ), with X taking values in Zq, we show H(X1 +X2 | Y1, Y2)−H(X|Y ) ≥ α(q) ·H(X|Y )(1−H(X|Y )) for some α(q) > 0, w...
متن کاملOn the complexity of the Arora-Ge Algorithm against LWE
Arora & Ge [5] recently showed that solving LWE can be reduced to solve a high-degree non-linear system of equations. They used a linearization to solve the systems. We investigate here the possibility of using Gröbner bases to improve Arora & Ge approach. Introduction The Learning With Errors (LWE) Problem was introduced by Regev in [27, 26]. It is a generalisation for large primes of the well...
متن کاملInteger-valued Polynomials over Quaternion Rings
When D is an integral domain with field of fractions K, the ring Int(D) = {f(x) ∈ K[x] | f(D) ⊆ D} of integer-valued polynomials over D has been extensively studied. We will extend the integer-valued polynomial construction to certain noncommutative rings. Specifically, let i, j, and k be the standard quaternion units satisfying the relations i = j = −1 and ij = k = −ji, and define ZQ := {a+bi+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1503.05704 شماره
صفحات -
تاریخ انتشار 2015